Logical Scaling in Formal Concept Analysis
نویسنده
چکیده
Logical scaling is a new method to transform data matrices which are based on object-attribute-value-relationships into data matrices from which conceptual hierarchies can be explored. The derivation of concept lattices is determined by terminologies expressed in a formal-logical language.
منابع مشابه
Searching for Objects and Properties with Logical Concept Analysis
Logical Concept Analysis is Formal Concept Analysis where logical formulas replace sets of attributes. We deene a Logical Information System that combines navigation and querying for searching for objects. Places and queries are uniied as formal concepts represented by logical formulas. Answers can be both extensional (objects belonging to a concept) and intensional (formulas reening a concept)...
متن کاملArbitrary Relations in Formal Concept Analysis and Logical Information Systems
A logical view of formal concept analysis considers attributes of a formal context as unary predicates. In a first part, we propose an augmented definition that handles binary relations between objects. A Galois connection is defined on augmented contexts. It represents concept inheritance as usual, but also relations between concepts. As usual, labeling operators are also defined. In particula...
متن کاملFormal Concept Analysis of Musicians’ Awareness for Musical Expression
This paper proposes a logical framework that visualizes musicians' conceptual structures that are acquired in skill communication processes for musical expression as rhetoric. Generally, these conceptual structures are difficult to show difference between experts and beginners. So, we first carry out a theoretical analysis of musicians' awareness for musical expression using Channel theory and ...
متن کاملFitting Pattern Structures to Knowledge Discovery in Big Data
Pattern structures, an extension of FCA to data with complex descriptions, propose an alternative to conceptual scaling (binarization) by giving direct way to knowledge discovery in complex data such as logical formulas, graphs, strings, tuples of numerical intervals, etc. Whereas the approach to classification with pattern structures based on preceding generation of classifiers can lead to dou...
متن کاملUsing Linguistic Hedges in L-rough Concept Analysis
We enrich concept-forming operators in L-rough Concept Analysis with linguistic hedges which model semantics of logical connectives ‘very’ and ‘slightly’. Using hedges as parameters for the concept-forming operators we are allowed to modify our uncertainty when forming concepts. As a consequence, by selection of these hedges we can control the size of concept lattice.
متن کامل